An optimizing method for embedding linear graphs in n-cube
نویسندگان
چکیده
منابع مشابه
An Optimizing Method for Embedding Linear Graphs in N-Cube
In this paper a method of embedding a linear graph in n-cube is discussed. Necessary and sufficient conditions on node configurations for the embeddability are obtained by analyzing the structure of n-cube in code space with respect to the distance 2c by means of Reed-Muller code. The fundamental idea in this study is to modify a given graph iteratively in such a manner that the connecting prop...
متن کاملA cycle embedding problem for Cube-Connected Cycles Graphs
Let n be an odd integer with n ≥ 3. The cube-connected cycles graph CCCn has n × 2 vertices, labeled (l,x), where 0 ≤ l ≤ n − 1 and x is an n-bit binary string. Two vertices (l,x) and (l′,y) are adjacent if and only if either x = y and |l − l′| = 1, or l = l′ and y = (x). In this paper, we will find the set of all possible lengths of cycles in CCCn with n is odd and n ≥ 3 .
متن کاملEmbedding Cube-Connected Cycles Graphs into Faulty Hypercubes
AbstructWe consider the problem of embedding a cubeconnected cycles graph (CCC) into a hypercube with edge faults. Our main result is an algorithm that, given a l i t of faulty edges, computes an embedding of the CCC that spans all of the nodes and avoids all of the faulty edges. The algorithm has optimal running time and tolerates the maximum number of faults (in a worst-case setting). Because...
متن کاملDynGEM: Deep Embedding Method for Dynamic Graphs
Embedding large graphs in low dimensional spaces has recently attracted significant interest due to its wide applications such as graph visualization, link prediction and node classification. Existing methods focus on computing the embedding for static graphs. However, many graphs in practical applications are dynamic and evolve constantly over time. Naively applying existing embedding algorith...
متن کاملLabeled embedding of (n, n-2)-graphs in their complements
21 Graph packing generally deals with unlabeled graphs. In [4], the authors 22 have introduced a new variant of the graph packing problem, called the 23 labeled packing of a graph. This problem has recently been studied on trees 24 [6] and cycles [4]. In this note, we present a lower bound on the labeled 25 packing number of any (n, n − 2)-graph into Kn. This result improves the 26 bound given ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1970
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(70)90509-7